Longest continuous increasing subsequence

Time: O(N); Space: O(1); easy

Given an unsorted array of integers, find the length of longest continuous increasing subsequence.

Example 1:

Input: nums = [1,3,5,4,7]

Output: 3

Explanation:

• The longest continuous increasing subsequence is [1,3,5], its length is 3.

• Even though [1,3,5,7] is also an increasing subsequence, it’s not a continuous one where 5 and 7 are separated by 4.

Example 2:

Input: nums = [2,2,2,2,2]

Output: 1

Explanation:

• The longest continuous increasing subsequence is [2], its length is 1.

class Solution(object):
    def findLengthOfLCIS(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        result, count = 0, 0
        for i in range(len(nums)):
            if i == 0 or nums[i-1] < nums[i]:
                count += 1
                result = max(result, count)
            else:
                count = 1
        return result

s = Solution()
nums = [1,3,5,4,7]
assert s.findLengthOfLCIS(nums) == 3
nums = [2,2,2,2,2]
assert s.findLengthOfLCIS(nums) == 1

See also:

https://leetcode.com/problems/longest-continuous-increasing-subsequence

https://www.lintcode.com/problem/longest-continuous-increasing-subsequence